- Davidon
- Математика: Дэвидон
Универсальный англо-русский словарь. Академик.ру. 2011.
Davidon
Смотреть что такое "Davidon" в других словарях:
Davidon–Fletcher–Powell formula — The Davidon–Fletcher–Powell formula (or DFP; named after William C. Davidon, Roger Fletcher, and Michael J. D. Powell) finds the solution to the secant equation that is closest to the current estimate and satisfies the curvature condition (see… … Wikipedia
Davidon-Fletcher-Powell formula — The Davidon Fletcher Powell formula (DFP) finds the solution to the secant equation that is closest to the current estimate and satisfies the curvature condition (see below). It was the first quasi Newton method which generalize the secant method … Wikipedia
Quasi-Newton-Verfahren — sind eine Klasse von numerischen Verfahren zur Lösung nichtlinearer Minimierungsprobleme. Die Verfahren basieren auf dem Newton Verfahren, berechnen die Inverse der Hesse Matrix jedoch nicht direkt, sondern nähern sie lediglich an, um den… … Deutsch Wikipedia
Sqp — Quasi Newton Verfahren sind eine Klasse von numerischen Verfahren zur Lösung nichtlinearer Minimierungsprobleme. Die Verfahren basieren auf dem Newton Verfahren, berechnen die Inverse der Hesse Matrix jedoch nicht direkt, sondern nähern sie… … Deutsch Wikipedia
Quasi-Newton method — In optimization, quasi Newton methods (also known as variable metric methods) are well known algorithms for finding local maxima and minima of functions. Quasi Newton methods are based on Newton s method to find the stationary point of a function … Wikipedia
XBP1 — X box binding protein 1, also known as XBP1, is a human gene.cite web | title = Entrez Gene: XBP1 X box binding protein 1| url = http://www.ncbi.nlm.nih.gov/sites/entrez?Db=gene Cmd=ShowDetailView TermToSearch=7494| accessdate = ] cite journal |… … Wikipedia
Méthode de Quasi-Newton — La méthode de Quasi Newton est une méthode numérique utilisée pour résoudre des systèmes d équations non linéaires. Typiquement, le problème que résout une méthode de Quasi Newton est f(x) = 0 avec dont on ne connaît pas forcément l expression… … Wikipédia en Français
Metaheuristic — In computer science, metaheuristic designates a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Metaheuristics make few or no assumptions about the… … Wikipedia
Pico-Union, Los Angeles, California — Pico Union is a district in Los Angeles, California. Its name derives from the intersection of Pico Boulevard and Union Avenue.Geography and TransportationPico Union, a sub district of the community of Westlake, is bordered by South Park on the… … Wikipedia
Cholesky decomposition — In linear algebra, the Cholesky decomposition or Cholesky triangle is a decomposition of a Hermitian, positive definite matrix into the product of a lower triangular matrix and its conjugate transpose. It was discovered by André Louis Cholesky… … Wikipedia
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
